Learning conjunctions of Horn clauses
نویسندگان
چکیده
منابع مشابه
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of structuring programs in logic programming. We are interested in finding correct and efficient translations from Horn⊃ programs into some representation type that, preserving the signature, allow us suitable implementations...
متن کاملSynchronizing Constrained Horn Clauses
Simultaneous occurrences of multiple recurrence relations in a system of non-linear constrained Horn clauses are crucial for proving its satisfiability. A solution of such system is often inexpressible in the constraint language. We propose to synchronize recurrent computations, thus increasing the chances for a solution to be found. We introduce a notion of CHC product allowing to formulate a ...
متن کاملGuarded Horn Clauses
This thesis introduces the programming language Guarded Horn Clauses which is abbreviated to GHC. Guarded Horn Clauses was born from the examination of existing logic programming languages and logic programming in general, with special attention paid to parallelism. The main feature of GHC is its extreme simplicity compared with the other parallel programming languages. GHC is a restriction of ...
متن کاملIterative Specialisation of Horn Clauses
We present a generic algorithm for solving Horn clauses through iterative specialisation. The algorithm is generic in the sense that it can be instantiated with any decidable fragment of Horn clauses, resulting in a solution scheme for general Horn clauses that guarantees soundness and termination, and furthermore, it presents sufficient criteria for completeness. We then demonstrate the use of...
متن کاملCononical Sets of Horn Clauses
Rewrite rules are oriented equations used to replace equals-by-equals in the speci ed direction. Input terms are repeatedly rewritten according to the rules. When and if no rule applies, the resultant normal form is considered the value of the initial term. If no in nite sequences of rewrites is possible, a rewrite system is said to have the termination property. Con uence of a rewrite system i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 1992
ISSN: 0885-6125,1573-0565
DOI: 10.1007/bf00992675